Bit complexity for multi-homogeneous polynomial system solving—Application to polynomial minimization
نویسندگان
چکیده
منابع مشابه
Bit complexity for multi-homogeneous polynomial system solving - Application to polynomial minimization
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input system under some genericity assumptions. The assumptions essentially imply that the Jacobian matrix of the system under study has maximal rank at the solution ...
متن کاملEigenvalue analysis of constrained minimization problem for homogeneous polynomial
In this paper, the concepts of Pareto H -eigenvalue and Pareto Z -eigenvalue are introduced for studying constrained minimization problem and the necessary and sufficient conditions of such eigenvalues are given. It is proved that a symmetric tensor has at least one Pareto H -eigenvalue (Pareto Z -eigenvalue). Furthermore, theminimumPareto H -eigenvalue (or Pareto Z -eigenvalue) of a symmetric ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملOn Low Complexity Bit Parallel Polynomial Basis Multipliers
Representing finite field elements with respect to the polynomial (or standard) basis, we consider a bit parallel multiplier architecture for the finite field GF (2). Time and space complexities of such a multiplier heavily depend on the field defining irreducible polynomials. Based on a number of important classes of irreducible polynomials, we give exact complexity analyses of the multiplier ...
متن کاملOn the bit-complexity of sparse polynomial multiplication
In this paper, we present fast algorithms for the product of two multivariate polynomials in sparse representation. The bit complexity of our algorithms are studied in detail for various types of coefficients, and we derive new complexity results for the power series multiplication in many variables. Our algorithms are implemented and freely available within the Mathemagix software. We show tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2018
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2017.08.001